Robust Necessary Optimality Conditions for Nondifferentiable Complex Fractional Programming with Uncertain Data
نویسندگان
چکیده
منابع مشابه
New Optimality Conditions for a Nondifferentiable Fractional Semipreinvex Programming Problem
In recent years, there has been an increasing interest in studying the develpoment of optimality conditions for nondifferentiable multiobjective programming problems. Many authors established and employed some different Kuhn and Tucker type necessary conditions or other type necessary conditions to research optimal solutions; see [1–27] and references therein. In [7], Lai and Ho used the Pareto...
متن کاملOptimality Conditions and Duality in Nondifferentiable Minimax Fractional Programming with Generalized Convexity1
We establish sufficient optimality conditions for a class of nondifferentiable minimax fractional programming problems involving (F, α, ρ, d)convexity. Subsequently, we apply the optimality conditions to formulate two types of dual problems and prove appropriate duality theorems.
متن کاملOptimality Conditions and Duality in Minmax Fractional Programming, Part I: Necessary and Sufficient Optimality Conditions
The purpose of this paper is to develop a fairly large number of sets of global parametric sufficient optimality conditions under various generalized (F, b, φ, ρ, θ)univexity assumptions for a continuous minmax fractional programming problem involving arbitrary norms.
متن کاملNecessary Optimality Conditions in Pessimistic Bilevel Programming Necessary Optimality Conditions in Pessimistic Bilevel Programming
This paper is devoted to the so-called pessimistic version of bilevel programming programs. Minimization problems of this type are challenging to handle partly because the corresponding value functions are often merely upper (while not lower) semicontinuous. Employing advanced tools of variational analysis and generalized differentiation, we provide rather general frameworks ensuring the Lipsch...
متن کاملNecessary and Sufficient Optimality Conditions for Fuzzy Linear Programming
This paper is concerned with deriving necessary and sufficient optimality conditions for a fuzzy linear programming problem. Toward this end, an equivalence between fuzzy and crisp linear programming problems is established by means of a specific ranking function. Under this setting, a main theorem gives optimality conditions which do not seem to be in conflict with the so-called Karush-Kuhn-Tu...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Optimization Theory and Applications
سال: 2021
ISSN: 0022-3239,1573-2878
DOI: 10.1007/s10957-021-01829-8